On Some Tighter Inapproximability Results, Further Improvements
نویسندگان
چکیده
Improved inaproximability results are given, including the best up to date explicit approximation thresholds for bounded occurence sat-issability problems, like MAX-2SAT and E2-LIN-2, and problems in bounded degree graphs, like MIS, Node Cover and MAX CUT. We prove also for the rst time inapproximability of the problem of Sorting by Reversals and display an explicit approximation threshold for this problem.
منابع مشابه
On Some Tighter Inapproximability Results
We give a number of improved inapproximability results, including the best up to date explicit approximation thresholds for bounded occurence satis ability problems like MAX2SAT and E2-LIN-2, and the bounded degree graph problems, like MIS, Node Cover, and MAX CUT. We prove also for the rst time inapproximability of the problem of Sorting by Reversals and display an explicit approximation thres...
متن کاملTowards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies
We present in this paper some of the recent techniques and methods for proving best up to now explicit approximation hardness bounds for metric symmetric and asymmetric Traveling Salesman Problem (TSP) as well as related problems of Shortest Superstring and Maximum Compression. We attempt to shed some light on the underlying paradigms and insights which lead to the recent improvements as well a...
متن کاملThe Foundation of Fixed Parameter Inapproximability
Given an instance I of a minimization problem with optimum opt, fixed parameter ρ(k) inapproximability is to find a k ≥ opt and prove that it is not possible to compute a solution of value ρ(k) · k. In this paper all proofs are under the eth. In this paper all ratios are larger than 1. An (r, t)-FPT-hardness (in opt) for two functions r, t, is showing that the problem admits no r(opt) approxima...
متن کاملOn the Hardness and Inapproximability of Optimization Problems on Power Law Graphs
The discovery of power law distribution in degree sequence (i.e. the number of vertices with degree i is proportional to i−β for some constant β) of many large-scale real networks creates a belief that it may be easier to solve many optimization problems in such networks. Our works focus on the hardness and inapproximability of optimization problems on power law graphs (PLG). In this paper, we ...
متن کاملTighter inapproximability for set cover
Set Cover is a classic NP-hard problem; as shown by Slav́ık (1997) the greedy algorithm gives an approximation ratio of lnn− ln lnn+Θ(1). A series of works by Lund & Yannakakis (1994), Feige (1998), Moshkovitz (2015) have shown that, under the assumption P 6= NP , it is impossible to obtain a polynomial-time approximation ratio with approximation ratio (1 − α) lnn, for any constant α > 0. In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 5 شماره
صفحات -
تاریخ انتشار 1998